Counting Minimal Symmetric Difference NFAs
نویسندگان
چکیده
A result of Nicaud states that the number of distinct unary regular string languages recognized by minimal deterministic finite automata (DFAs) with n states is asymptotically equal to n2n−1. We consider the analogous question for symmetric difference automata (Z2NFAs), and show that precisely 22n−1 unary languages are recognized by n-state minimal Z2-NFAs.
منابع مشابه
Minimal DFA for Symmetric Difference NFA
Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric difference NFAs. Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA.
متن کاملDescriptional Complexity of Ambiguity in Symmetric Difference NFAs
We investigate ambiguity for symmetric difference nondeterministic finite automata. We show the existence of unambiguous, finitely ambiguous, polynomially ambiguous and exponentially ambiguous symmetric difference nondeterministic finite automata. We show that, for each of these classes, there is a family of n-state nondeterministic finite automata such that the smallest equivalent deterministi...
متن کاملAmbiguity and structural ambiguity of symmetric difference NFAs
Okhotin showed an exponential trade-off in the conversion from nondeterministic unary automata to unambiguous nondeterministic unary automata. We show that the trade-off in the case of unary symmetric difference automata to finitely (structurally) ambiguous unary symmetric difference automata is linear with constant 1 in the number of states. In particular, for every n-state unary nondeterminis...
متن کاملAmbiguity of Unary Symmetric Difference NFAs
Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the fi...
متن کاملConstruction of minimal DFAs from biological motifs
Deterministic finite automata (DFAs) are constructed for various purposes in computational biology. Little attention, however, has been given to the efficient construction of minimal DFAs. In this article, we define simple nondeterministic finite automata (NFAs) and prove that the standard subset construction transforms NFAs of this type into minimal DFAs. Furthermore, we show how simple NFAs c...
متن کامل